299 - Train swapping/299.cpp

   1 #include <algorithm>
   2 #include <stdio.h>
   3 int tren[50], c, l, i, j, r;
   4
   5 int bubblesort(){
   6   for (r=0, i=1; i<l; i++)
   7     for (j=0; j<l-1; j++)
   8       if (tren[j] > tren[j+1]){
   9         std::swap(tren[j], tren[j+1]);
  10         r++;
  11       }
  12   return r;
  13 }
  14
  15 int main(){
  16   for (scanf("%d", &c); c--; printf("Optimal train swapping takes %d swaps.\n", bubblesort())){
  17     for (scanf("%d", &l), i = 0; i<l; scanf("%d", &tren[i++]));
  18   }
  19   return 0;
  20 }